Termination w.r.t. Q proof of TRS/TRCSREx1_GL02a

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__eq(0, 0) → true
a__eq(s(X), s(Y)) → a__eq(X, Y)
a__eq(X, Y) → false
a__inf(X) → cons(X, inf(s(X)))
a__take(0, X) → nil
a__take(s(X), cons(Y, L)) → cons(Y, take(X, L))
a__length(nil) → 0
a__length(cons(X, L)) → s(length(L))
mark(eq(X1, X2)) → a__eq(X1, X2)
mark(inf(X)) → a__inf(mark(X))
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(length(X)) → a__length(mark(X))
mark(0) → 0
mark(true) → true
mark(s(X)) → s(X)
mark(false) → false
mark(cons(X1, X2)) → cons(X1, X2)
mark(nil) → nil
a__eq(X1, X2) → eq(X1, X2)
a__inf(X) → inf(X)
a__take(X1, X2) → take(X1, X2)
a__length(X) → length(X)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a__eq(0, 0) → true
a__eq(s(X), s(Y)) → a__eq(X, Y)
a__eq(X, Y) → false
a__inf(X) → cons(X, inf(s(X)))
a__take(0, X) → nil
a__take(s(X), cons(Y, L)) → cons(Y, take(X, L))
a__length(nil) → 0
a__length(cons(X, L)) → s(length(L))
mark(eq(X1, X2)) → a__eq(X1, X2)
mark(inf(X)) → a__inf(mark(X))
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(length(X)) → a__length(mark(X))
mark(0) → 0
mark(true) → true
mark(s(X)) → s(X)
mark(false) → false
mark(cons(X1, X2)) → cons(X1, X2)
mark(nil) → nil
a__eq(X1, X2) → eq(X1, X2)
a__inf(X) → inf(X)
a__take(X1, X2) → take(X1, X2)
a__length(X) → length(X)

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

[a_{_eq₂}, mark_1] > true > length₁
[a_{_eq₂}, mark_1] > false > length₁
[a_{_eq₂}, mark_1] > a_{_inf₁} > cons₂ > [0, s₁, a_{_{length_1]}} > length₁
[a_{_eq₂}, mark_1] > a_{_inf₁} > cons₂ > take₂ > length₁
[a_{_eq₂}, mark_1] > a_{_inf₁} > inf₁ > length₁
[a_{_eq₂}, mark_1] > a_{_take₂} > cons₂ > [0, s₁, a_{_{length_1]}} > length₁
[a_{_eq₂}, mark_1] > a_{_take₂} > cons₂ > take₂ > length₁
[a_{_eq₂}, mark_1] > a_{_take₂} > nil > [0, s₁, a_{_{length_1]}} > length₁
[a_{_eq₂}, mark_1] > eq₂ > length₁

Status:

length₁: [1]
mark₁: [1]
a_{_length₁}: [1]
a_{_eq₂}: [1,2]
eq₂: [2,1]
0: multiset
nil: multiset
a_{_take₂}: [1,2]
cons₂: [1,2]
true: multiset
false: multiset
s₁: [1]
take₂: [1,2]
inf₁: [1]
a_{_inf₁}: [1]